An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques

نویسندگان

  • Weijia Jia
  • Gaochao Xu
  • Dong Xuan
  • Wei Zhao
چکیده

In this paper, we study an efficient fault-tolerant CBT multicast routing protocol. With our strategy, when a faulty component is detected, some pre-defined backup path(s) is (are) used to bypass the faulty component and enable the multicast communication to continue. Our protocol only requires that routers near the faulty component be reconfigured, thus reducing the runtime overhead without compromising much of the performance. Our performance evaluation shows that our new protocol performs nearly as well as the best possible global method while utilizing much less runtime overhead and implementation cost.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Fau It-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques

In this paper, we design and analyze an efficient fault-tolerant multicast routing protocol. Reliable multicast communication is critical for the success of many Internet applications. Multicast routing protocols with core-based tree techniques (CBT) have been widely used because of their scalability and simplicity. We enhance the CBT protocol with fault tolerance capability and improve its eff...

متن کامل

Optimal Core Selection for Multicast Tree Routing in Hypercube Networks

This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube networks using shared tree routing approach. The algorithms can select an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient as compared with the existing multicast algori...

متن کامل

Tree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching

A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links without requiring nodes to have global fault information. The multicast algorithm is provably deadloc...

متن کامل

Managing Group Dynamics and Failures in QoS Multicasting

The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the need for scalable and efficient network support. In addition to requiring network support, the group-based applications also demand stringent QoS requirements in terms of end-to-end delay, delay jitter, and loss. It is the responsibility of the multicast routing protocol to construct ...

متن کامل

Core-based Routing with QoS Support for Distributed Interactive Multimedia Applications

Distributed interactive multimedia applications such as video conferencing and virtual collaboration applications typically involve frequent interactions among multiple distributed parties. These applications require an efficient networking support such as core-based routing with Quality of Service (QoS) support. Typical core-based routing selects one router as a core for a multicast group and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Parallel Distrib. Syst.

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1999